Sampling-based Multi-robot Motion Planning
نویسندگان
چکیده
This paper describes a sampling-based approach to multi-robot motion planning. The proposed approach is centralized, which aims to reduce interference between mobile robots such as collision, congestion and deadlock, by increasing the number of waypoints. The implementation based on occupancy grid map is decomposed into three steps: the first step is to identify primary waypoints by using the Voronoi diagram, the second step is to generate additional waypoints by sampling the Voronoi diagram, and the last step is to assign the waypoints to robots by using the Hungarian method. The approach has been implemented and tested in simulation and the experimental results show a good system performance for multi-robot motion planning.
منابع مشابه
ACS-PRM: Adaptive Cross Sampling Based Probabilistic Roadmap for Multi-robot Motion Planning
In this paper we present a novel approach for multi-robot motion planning by using a probabilistic roadmap (PRM) based on adaptive cross sampling (ACS). The proposed approach, we call ACSPRM, consists of three steps, which are C-space sampling, roadmap building and motion planning. Firstly, an adequate number of points should be generated in C-space on an occupancy grid map by using an adaptive...
متن کاملMulti-Robot Motion Planning
We present a simple and natural extension of the multi-robot motion planning problem where the robots are partitioned into groups (colors), such that in each group the robots are interchangeable. Every robot is no longer required to move to a specific target, but rather to some target placement that is assigned to its group. We call this problem k-color multi-robot motion planning and provide a...
متن کاملk-Color Multi-robot Motion Planning
We present a simple and natural extension of the multi-robot motion planning problem where the robots are partitioned into groups (colors), such that in each group the robots are interchangeable. Every robot is no longer required to move to a specific target, but rather to some target placement that is assigned to its group. We call this problem k-color multi-robot motion planning and provide a...
متن کاملTowards a Probabilistic Roadmap for Multi-robot Coordination
In this paper, we discuss the problem of multirobot coordination and propose an approach for coordinated multi-robot motion planning by using a probabilistic roadmap (PRM) based on adaptive cross sampling (ACS). The proposed approach, called ACS-PRM, is a samplingbased method and consists of three steps including Cspace sampling, roadmap building and motion planning. In contrast to previous app...
متن کاملCooperative Multi-Robot Sampling-Based Motion Planning with Dynamics
This paper develops an effective, cooperative, and probabilistically-complete multi-robot motion planner. The approach takes into account geometric and differential constraints imposed by the obstacles and the robot dynamics by using sampling to expand a motion tree in the composite state space of all the robots. Scalability and efficiency is achieved by using solutions to a simplified problem ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013